Communication between information systems with covering based rough sets
نویسندگان
چکیده
Communication between information systems is considered as an important issue in granular computing. The concept of homomorphism is an effective mathematical tool to study information exchange between information systems. This paper provides a study on some basic properties of covering information systems and decision systems under homomorphisms. First, we define consistent functions related to coverings and covering mappings between two universes, and study their properties. Then, we introduce the notions of homomorphisms of covering information systems and point out that a homomorphism is a special covering mapping between information systems. Furthermore, we investigate some important properties of homomorphisms in covering information systems and decision systems. It is proved that some basic properties of original systems, such as set approximations, attribute reductions, can be reserved under the condition of homomorphisms in both covering information systems and covering decision systems. 2012 Elsevier Inc. All rights reserved.
منابع مشابه
Multigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making
In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...
متن کاملGeneralized fuzzy rough sets based on fuzzy coverings
This paper further studies the fuzzy rough sets based on fuzzy coverings. We first present the notions of the lower and upper approximation operators based on fuzzy coverings and derive their basic properties. To facilitate the computation of fuzzy coverings for fuzzy covering rough sets, the concepts of fuzzy subcoverings, the reducible and intersectional elements, the union and intersection o...
متن کاملA New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)
Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...
متن کاملTopological Spaces and Covering Rough Sets
Rough set theory (RST) is a modern tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. One of the limitations of RST is its dependence on portioning the universe according to equivalence relation on the universe of objects in information systems. The purpose of this paper is to construct connections between generalized rough sets based on cove...
متن کاملStructure of Covering-based Rough Sets
Rough set theory is a very effective tool to deal with granularity and vagueness in information systems. Covering-based rough set theory is an extension of classical rough set theory. In this paper, firstly we present the characteristics of the reducible element and the minimal description covering-based rough sets through downsets. Then we establish lattices and topological spaces in coveringb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 216 شماره
صفحات -
تاریخ انتشار 2012